Threshold Based Penalty Functions for Constrained Multiobjective Optimization
نویسندگان
چکیده
منابع مشابه
Threshold Based Penalty Functions for Constrained Multiobjective Optimization
This paper compares the performance of our recently proposed threshold based penalty function against its dynamic and adaptive variants. These penalty functions are incorporated in the update and replacement scheme of the multiobjective evolutionary algorithm based on decomposition (MOEA/D) framework to solve constrained multiobjective optimization problems (CMOPs). As a result, the capability ...
متن کاملFlexible Penalty Functions for Nonlinear Constrained Optimization
[Received on 31 March 2007] We propose a globalization strategy for nonlinear constrained optimization. The method employs a “flexible” penalty function to promote convergence, where during each iteration the penalty parameter can be chosen as any number within a prescribed interval, rather than a fixed value. This increased flexibility in the step acceptance procedure is designed to promote lo...
متن کاملNonlinear Separation for Constrained Multiobjective Optimization Problems and Applications to Penalty Functions
In this paper, we prove a nonlinear separation associated with a constrained multiobjective optimization problem in the image space, as well as the equivalence between the existence of nonlinear separation function and a saddle point condition for a generalized Lagrangian function associated with the given problem. As applications, we obtain some equivalent conditions on exact penalty methods f...
متن کاملAn Objective Penalty Functions Algorithm for Multiobjective Optimization Problem
By using the penalty function method with objective parameters, the paper presents an interactive algorithm to solve the inequality constrained multi-objective programming (MP). The MP is transformed into a single objective optimal problem (SOOP) with inequality constrains; and it is proved that, under some conditions, an optimal solution to SOOP is a Pareto efficient solution to MP. Then, an i...
متن کاملQuasi-Newton Methods for Nonconvex Constrained Multiobjective Optimization
Here, a quasi-Newton algorithm for constrained multiobjective optimization is proposed. Under suitable assumptions, global convergence of the algorithm is established.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Advanced Computer Science and Applications
سال: 2016
ISSN: 2156-5570,2158-107X
DOI: 10.14569/ijacsa.2016.070282